Normal forms for general polynomial matrices
نویسندگان
چکیده
منابع مشابه
Normal forms for general polynomial matrices
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomial matrix. For specific input shifts, we obtain methods for computing the matrix greatest common divisor of two matrix polynomials (in normal form) or such polynomial normal form computation as the classical Popov form and the Hermite Normal Form. The method is done by embedding the problem of co...
متن کاملStable normal forms for polynomial system solving
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I . The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [29]. This general border basis algorithm weakens the monomial ordering requirement for Gröbner bases computations. It is up to date the ...
متن کاملComputing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time
We prove that the Jordan Normal Form of a rational matrix can be computed exactly in polynomial time. We obtain the transformation matrix and its inverse exactly, and we show how to apply the basis transformation to any commuting matrices.
متن کاملRandom Normal Matrices and Polynomial Curves
Abstract. We show that in the large matrix limit, the eigenvalues of the normal matrix model for matrices with spectrum inside a compact domain with a special class of potentials homogeneously fill the interior of a polynomial curve uniquely defined by the area of its interior domain and its exterior harmonic moments which are all given as parameters of the potential. Then we consider the ortho...
متن کاملDynamic Normal Forms and Dynamic Characteristic Polynomial
We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updates in O(n log n) randomized time and queries in constant time, whereas in the general case the algorithm works in O(nk log n) randomized time, where k is the number of invariant factors of the matrix. The algorithm is based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2006
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2006.02.001